Resource-driven Substructural Defeasible Logic

Linear Logic and Defeasible Logic have been adopted to formalise different features relevant to agents: consumption of resources, and reasoning with exceptions. We propose a framework to combine sub-structural features, corresponding to the consumption of resources, with defeasibility aspects, and we discuss the design choices for the framework

FungalTraits:A user-friendly traits database of fungi and fungus-like stramenopiles

The cryptic lifestyle of most fungi necessitates molecular identification of the guild in environmental studies. Over the past decades, rapid development and affordability of molecular tools have tremendously improved insights of the fungal diversity in all ecosystems and habitats. Yet, in spite of the progress of molecular methods, knowledge about functional properties of the fungal taxa is vague and interpretation of environmental studies in an ecologically meaningful manner remains challenging. In order to facilitate functional assignments and ecological interpretation of environmental studies we introduce a user friendly traits and character database FungalTraits operating at genus and species hypothesis levels. Combining the information from previous efforts such as FUNGuild and Fun(Fun) together with involvement of expert knowledge, we reannotated 10,210 and 151 fungal and Stramenopila genera, respectively. This resulted in a stand-alone spreadsheet dataset covering 17 lifestyle related traits of fungal and Stramenopila genera, designed for rapid functional assignments of environmental studies. In order to assign the trait states to fungal species hypotheses, the scientific community of experts manually categorised and assigned available trait information to 697,413 fungal ITS sequences. On the basis of those sequences we were able to summarise trait and host information into 92,623 fungal species hypotheses at 1% dissimilarity threshold

Encoding of Planning Problems and Their Optimizations in Linear Logic

Girard’s Linear Logic is a formalism which can be used to manage a lot of problems with consumable resources. Its expressiveness is quite good for an easily understandable encoding of many problems. We concentrated on expressing planning problems by linear logic in this paper. We observed a rich usage of a construct of consumable resources in planning problem formulations. This fact motivates us to provide a possible encoding of planning problems in linear logic. This paper shows how planning problems can be encoded in Linear Logic and how some optimizations of planning problems can be encoded. These optimizations can help planners to improve the efficiency of finding solutions (plans)

Symbolic agent negotiation for Semantic Web service exploitation

Abstract. This paper presents an architecture and a methodology for agent-based Web service discovery and composition. We assume that Web services are described with declarative specifications like DAML-S. Based on the declarative information about services, symbolic reasoning can be applied while searching for or composing automatically new services. We propose that symbolic agent negotiation could be used for dynamic Web service discovery and composition. Symbolic negotiation, as we consider it here, is a mixture of distributed planning and information exchange. Therefore, by using symbolic negotiation for automated service composition, we support information collection and integration during service composition. The latter aspect has been largely neglected in automated service composition until now.

Advancements in Resource-Driven Substructural Defeasible Logic

Linear Logic and Defeasible Logic have been adopted to formalise different features of knowledge representation: consumption of resources and reasoning with exceptions. We propose a framework to combine sub-structural features, corresponding to the consumption of resources, with defeasibility aspects to handle potentially conflicting information, and we discuss the design choices

Coordination: Reo, nets, and logic

This article considers the coordination language Reo, a Petri net variant called zero-safe nets, and intuitionistic temporal linear logic (ITLL). The first part examines the semantics of the coordination language Reo in relation to zero-safe nets. Although the external presentations of the two models are quite different, the difference in underlying semantics is rather small. In fact, Reo connectors can be compositionally encoded into zero-safe nets. This means that the tools and techniques developed for Petri nets over the last 30 years, such as various extensions to the zero-safe nets model, such reconfigurable and dynamic nets, can be adapted to the Reo setting. The second part re-examines the idea of using linear logic as a basis for coordination languages. Specifically, we argue that intuitionistic temporal linear logic (ITLL) can encode the semantics of Reo and zero-safe nets, by encoding their notion of transaction. Moreover, by adapting the encoding and exploring the additional connectives of ITLL, it can form the basis of an expressive coordination language which goes beyond these models, by introducing means for explicitly reasoning about choices made by the environment and by providing more fine-grained control over the timing of interaction.status: publishe